翻訳と辞書 |
Intersection number (graph theory) : ウィキペディア英語版 | Intersection number (graph theory) In the mathematical field of graph theory, the intersection number of a graph is the smallest number of elements in a representation of as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover all of the edges of .〔.〕〔.〕 ==Intersection graphs== Let be a family of sets (allowing sets in to be repeated); then the intersection graph of is an undirected graph that has a vertex for each member of and an edge between each two members that have a nonempty intersection. Every graph can be represented as an intersection graph in this way.〔.〕 The intersection number of the graph is the smallest number such that there exists a representation of this type for which the union of has elements.〔 The problem of finding an intersection representation of a graph with a given number of elements is known as the intersection graph basis problem.〔, Problem GT59.〕
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Intersection number (graph theory)」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|